Minimal cut problems on an infinite network
نویسندگان
چکیده
منابع مشابه
Minimal-Cut Shape Composition
Constructing new, complex models is often done by reusing parts of existing models, typically by applying a sequence of segmentation, alignment and composition operations. Segmentation, either manual or automatic, is rarely adequate for this task, since it is applied to each model independently, leaving it to the user to trim the shapes and determine where to connect them. In this paper we prop...
متن کاملOn the Minimal Covering of Infinite Sets
Klimb, J., On the minimal covering of infinite sets, Discrete Applied Mathematics 45 (1993) 161-168. Minimal covering of infinite sets is studied. It is shown that if BC2’ is closed, then /* contains a minimal covering of X. If r// is a covering of X, then fl is closed on X if and only if there is an admissible functionf: X-1 4 which has no chain. For star type set systems Theorem 15 gives a su...
متن کاملFlux in an Infinite Network
In an infinite network, we introduce the notion of flux which is an important concept in the study of many physical problems. The basic tool needed, namely the discrete version of the Green’s formula, is proved here in a generalized form.
متن کاملA branch-and-cut algorithm for capacitated network design problems
We present a branch-and-cut algorithm to solve capacitated network design problems. Given a capacitated network and point-to-point traac demands, the objective is to install more capacity on the edges of the network and route traac simultaneously, so that the overall cost is minimized. We study a mixed-integer programming formulation of the problem and identify some new facet deening inequaliti...
متن کاملMinimal cut sets in a metabolic network are elementary modes in a dual network
MOTIVATION Elementary modes (EMs) and minimal cut sets (MCSs) provide important techniques for metabolic network modeling. Whereas EMs describe minimal subnetworks that can function in steady state, MCSs are sets of reactions whose removal will disable certain network functions. Effective algorithms were developed for EM computation while calculation of MCSs is typically addressed by indirect m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hiroshima Mathematical Journal
سال: 1977
ISSN: 0018-2079
DOI: 10.32917/hmj/1206135755